Operating System Discovery Using Answer Set Programming
نویسنده
چکیده
The goal of operating system (OS) discovery is to learn which OS is running on a remote computer by looking at differences in the TCP/IP stack implementation of different vendors. There are two main strategies for OS discovery: passive, where deductions are made by looking at regular communications between computers, and active, where stimuli are sent to the target to see how it reacts in specific (often non-standard) situations. Each technique has its advantages as well as its drawbacks. The work described here studies how logic programming under the answer set semantics can be used to address, in a simple and elegant way, the task of operating system discovery by logically specifying the problem and providing solutions through automated reasoning. As a result of using such a knowledge representation framework, it is possible to unify the active and passive methods for OS discovery in a single hybrid approach that has the advantages of both strategies while being much more versatile. Current passive tools for OS discovery (OSD) have huge limitations. First, each packet is processed individually, meaning a stimulus-response correlation is not possible. Secondly, they are memoryless; that is, each packet is considered as being the only available information without considering the previous deductions. This greatly limits their accuracy. While active OSD tools are much more accurate, they also have shortcomings. First, they are usually very noisy (sometimes generating several hundreds of packets to discover the OS of a single host). Secondly, they often generate abnormal traffic (to see how the host reacts in non-standard situations) which may interfere with network monitoring tools such as intrusion detection systems. To circumvent those problems, we propose to use logic programming to implement a passive OSD module, and planning (on top of the passive module) to implement an active module, in a hybrid approach.
منابع مشابه
Adaptive Setting of UFLS Relay Using Hourly Programming with Consideration of Renewable Energy Sources in Smart Grid
In the light of the emergence of smart grids, the functions associated with this type of grids in the blocks of the energy management system require the adoption of robust strategies in order to provide a higher level of control and protection. Under-frequency load shedding (UFLS) sheds load blocks when the frequency drop is below the threshold limit. In adaptive UFLS, in an advanced telecommun...
متن کاملAn Integrated Framework for Semantic Service Composition using Answer Set Programming
Notwithstanding the advancement of service computing in recent years, service composition is still main issue in this field. In this paper, we present an integrated framework for semantic service composition using answer set programming. Unlike the AI planning approaches of top-down workflow with nested composition and combining composition procedure into service discovery, this proposed framew...
متن کاملInvestigating Embedded Question Reuse in Question Answering
The investigation presented in this paper is a novel method in question answering (QA) that enables a QA system to gain performance through reuse of information in the answer to one question to answer another related question. Our analysis shows that a pair of question in a general open domain QA can have embedding relation through their mentions of noun phrase expressions. We present methods f...
متن کاملInteractive Answer Set Programming - Preliminary Report
Traditional Answer Set Programming (ASP) rests upon one-shot solving. A logic program is fed into an ASP system and its stable models are computed. The high practical relevance of dynamic applications led to the development of multi-shot solving systems. An operative system solves continuously changing logic programs. Although this was primarily aiming at dynamic applications in assisted living...
متن کاملReasoning and Planning with Cooperative Actions for Multiagents Using Answer Set Programming
In this paper, we investigate the multiagent planning problem in the presence of cooperative actions and agents, which have their own goals and are willing to cooperate. To this end, we extend the action language A in [12] to represent and reason about plans with cooperative actions of an individual agent operating in a multiagent environment. We then use the proposed language to formalize the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007